Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut
نویسندگان
چکیده
منابع مشابه
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
We consider the problem of scheduling jobs with given release times and due dates on a single machine to minimize the maximum job lateness. It is NP-hard and remains such if the maximal job processing time is unrestricted and there is no constant bound on the difference between any job release times. We give a polynomial-time solution of the version in which the maximal job processing time and ...
متن کاملWorking Paper Branch and Bound Algorithms for Minimizing Maximum Lateness of Trucks at a Transshipment Terminal
This paper focuses on the scheduling of trucks at a transshipment terminal with a single gate. Trucks deliver or pick up a single type of items at the gate and, therefore, increase or decrease, respectively, the inventory level. Naturally, pick up trucks can be served only if the required amount of items is available in the inventory. We consider the problem to find a schedule for trucks such t...
متن کاملA polynomial-time algorithm for a special case of minimizing the lateness on a single machine
We study the problem of scheduling jobs with release times and due-dates on a single machine with the objective to minimize the maximal job lateness. This problem is strongly NP-hard, however it is known to be polynomially solvable for the case when the processing times of some jobs are restricted to either p or 2p, for some integer p. We present a polynomial-time algorithm when job processing ...
متن کاملA new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs
Article history: Received 10 March 2010 Received in revised form July, 25, 2011 Accepted 26 July 2011 Available online 27 July 2011 This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which deliv...
متن کاملAlgorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints
Blazewicz, J., W. Kubiak and S. Martello, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, Discrete Applied Mathematics 42 (1993) 1233138. The problem we consider is that of scheduling n unit length tasks on identical processors in the presence of additional scarce resources. The objective is to minimize maximum lateness. It has been known for some tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2018
ISSN: 0360-8352
DOI: 10.1016/j.cie.2017.11.016